The geodetic number of strong product graphs
نویسندگان
چکیده
For two vertices u and v of a connected graph G, the set IG[u, v] consists of all those vertices lying on u − v geodesics in G. Given a set S of vertices of G, the union of all sets IG[u, v] for u, v ∈ S is denoted by IG[S]. A set S ⊆ V (G) is a geodetic set if IG[S] = V (G) and the minimum cardinality of a geodetic set is its geodetic number g(G) of G. Bounds for the geodetic number of strong product graphs are obtainted and for several classes improved bounds and exact values are obtained.
منابع مشابه
Distinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملThe Geodetic Domination Number for the Product of Graphs
A subset S of vertices in a graph G is called a geodetic set if every vertex not in S lies on a shortest path between two vertices from S. A subset D of vertices in G is called dominating set if every vertex not in D has at least one neighbor in D. A geodetic dominating set S is both a geodetic and a dominating set. The geodetic (domination, geodetic domination) number g(G)(γ(G), γg(G)) of G is...
متن کاملOn the geodetic and the hull numbers in strong product graphs
A set S of vertices of a connected graph G is convex, if for any pair of vertices u, v ∈ S , every shortest path joining u and v is contained in S . The convex hull CH(S ) of a set of vertices S is defined as the smallest convex set in G containing S . The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it is said to be a hull set if its convex ...
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملThe edge geodetic number and Cartesian product of graphs
For a nontrivial connected graph G = (V (G), E(G)), a set S ⊆ V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum order of its edge geodetic sets. Bounds for the edge geodetic number of Cartesian product graphs are proved and improved upper bounds are determined for a speci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 30 شماره
صفحات -
تاریخ انتشار 2010